The cyclic structure of unimodal permutations
نویسنده
چکیده
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure — e.g. 23 of them contain fixed points — are given. We also obtain in effect a kind of combinatorial universality for continuous unimodal maps, by severely constraining the possible ways periodic orbits of any such map can nestle together. But our main observation (and tool) is the existence of a natural noncommutative monoidal structure on this class of permutations which respects their cyclic structure. This monoidal structure is a little mysterious, and can perhaps be understood by broadening the context, e.g. by looking for similar structure in other classes of ‘pattern-avoiding’ permutations.
منابع مشابه
Descents of λ-unimodal cyclic permutations
We prove an identity conjectured by Adin and Roichman involving the descent set of λ-unimodal cyclic permutations. These permutations appear in the character formulas for certain representations of the symmetric group and these formulas are usually proven algebraically. Here, we give a combinatorial proof for one such formula and discuss the consequences for the distribution of the descent set ...
متن کاملUnimodal Permutations and Almost-Increasing Cycles
In this paper, we establish a natural bijection between the almost-increasing cyclic permutations of length n and unimodal permutations of length n − 1. This map is used to give a new characterization, in terms of pattern avoidance, of almostincreasing cycles. Additionally, we use this bijection to enumerate several statistics on almost-increasing cycles. Such statistics include descents, inver...
متن کاملThe Cycle Enumerator of Unimodal Permutations
We give a generating function for the number of unimodal permutations with a givencycle structure.
متن کاملShort note on complexity and approximability of unimodal partitions of permutations
We extend results of Wagner [8] and Fomin, Kratsch, and Novelle [6] on monotone partitions of permutations. We show that partitioning a sequence of distinct integers into unimodal subsequences is NP-complete and that a minimum unimodal partition is 3.42-approximable in polynomial time.
متن کاملCounting involutory, unimodal, and alternating signed permutations
In this work we count the number of involutory, unimodal, and alternating elements of the group of signed permutations Bn, and the group of even-signed permutations Dn. Recurrence relations, generating functions, and explicit formulas of the enumerating sequences are given. © 2006 Elsevier B.V. All rights reserved. MSC: primary: 05A15; secondary: 05A19; 05A05
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 237 شماره
صفحات -
تاریخ انتشار 2001